Channel selection method and transmit end

ABSTRACT

A channel selection method and a transmit end are provided. The method includes: ranking multiple channels, and generating a backoff count value; sequentially decrementing, from an initial timeslot, the backoff count value in each timeslot according to a ranking sequence of the channels and busy/idle states of all the channels until the backoff count value is 0; and selecting, from the multiple channels according to a result of the decrement performed on the backoff count value and a busy/idle state of at least one of the multiple channels, a channel that is used by the transmit end for sending data. The method and the transmit end can improve channel utilization.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/446,871, filed on Mar. 1, 2017, which is a continuation ofInternational Application No. PCT/CN2014/085675, filed on Sep. 1, 2014.All of the afore-mentioned patent applications are hereby incorporatedby reference in their entireties.

TECHNICAL FIELD

Embodiments of the present invention relate to the field ofcommunications technologies, and in particular, to a channel selectionmethod and a transmit end.

BACKGROUND

A Wireless Fidelity (WiFi for short) system can operate in amulti-channel/multi-subchannel scenario. For a multi-channel scenario, achannel selection method for maintaining multiple backoff counters onmultiple channels is put forward at present. It is assumed that thereare N channels in total in the system, and each channel is correspondingto one backoff counter. When a station (STA for short) or an accesspoint (AP for short) needs to send data, the STA or the AP executes thefollowing processes to select a channel for sending the data: randomlygenerating backoff count values of backoff counters on all the channels,and simultaneously performing carrier sense multiple access (CSMA forshort) access on all the channels; when a backoff count value of an idlechannel is decreased to 0, preempting the channel; and determiningwhether the preempted channel meets a bandwidth requirement, and if thepreempted channel meets the bandwidth requirement, ending backoff, or ifthe preempted channel does not meet the bandwidth requirement,determining whether there is an optional idle channel, and if there isan optional idle channel, adjusting a backoff count value of a backoffcounter on the idle channel, and continuing to simultaneously performCSMA access on all idle channels, or if there is no optional idlechannel, ending backoff.

However, the inventor finds that a backoff time required by such achannel selection method is long, thereby resulting in low channelutilization.

SUMMARY

Embodiments provide a channel selection method and a transmit end, whichcan improve channel utilization.

To resolve the foregoing technical problem, the embodiments disclose thefollowing technical solutions:

According to a first aspect, an embodiment provides a channel selectionmethod, including:

ranking multiple channels, and generating a backoff count value;

sequentially decrementing, from an initial timeslot, the backoff countvalue in each timeslot according to a ranking sequence of the channelsand busy/idle states of all the channels until the backoff count valueis 0; and

selecting, from the multiple channels according to a result of thedecrement performed on the backoff count value and a busy/idle state ofat least one of the multiple channels, a channel that is used by atransmit end for sending data.

According to a second aspect, an embodiment provides a transmit end,including: a ranking unit, a generation unit, a decrement unit, and aselection unit, where

the ranking unit is configured to rank multiple channels;

the generation unit is configured to generate a backoff count value;

the decrement unit is configured to sequentially decrement, from aninitial timeslot, the backoff count value in each timeslot according toa sequence of ranking the channels by the ranking unit and busy/idlestates of all the channels until the backoff count value is 0; and

the selection unit is configured to select, from the multiple channelsaccording to a result of the decrement performed by the decrement uniton the backoff count value and a busy/idle state of at least one of themultiple channels, a channel that is used by the transmit end forsending data.

In the embodiments, multiple channels are ranked, and a backoff countvalue is generated; from an initial timeslot, the backoff count value issequentially decremented in each timeslot according to a rankingsequence of the channels and busy/idle states of all the channels untilthe backoff count value is 0; and a channel that is used by a transmitend for sending data is selected from the multiple channels according toa result of the decrement performed on the backoff count value and abusy/idle state of at least one of the multiple channels, so that in achannel selection process, all channels use a same backoff count value,and the backoff count value is decremented according to a busy/idlestate of each channel, which makes a total subtracted value of thebackoff count value in each timeslot greater than or equal to a quantityof idle channels, thereby accelerating a speed of decrementing thebackoff count value to 0, shortening a backoff time in the channelselection process, and improving channel utilization.

BRIEF DESCRIPTION OF DRAWINGS

To describe the technical solutions in the embodiments more clearly, thefollowing briefly describes the accompanying drawings required fordescribing the embodiments or the conventional art. Apparently, a personof ordinary skill in the art may still derive other drawings from theseaccompanying drawings without creative efforts.

FIG. 1 is a schematic diagram of a channel selection process of multiplechannels in the conventional art;

FIG. 2 is an exemplary diagram of an application scenario according toan embodiment;

FIG. 3 is a schematic diagram of an embodiment of a channel selectionmethod according to the disclosure;

FIG. 4 is a schematic diagram of another embodiment of a channelselection method according to the disclosure;

FIG. 5A is a schematic diagram of an implementation method of step 401according to the disclosure;

FIG. 5B is a schematic diagram of another implementation method of step401 according to the disclosure;

FIG. 6 is a schematic diagram of an embodiment of a transmit endaccording to the disclosure; and

FIG. 7 is a schematic diagram of another embodiment of a transmit endaccording to the disclosure.

DESCRIPTION OF EMBODIMENTS

The following clearly describes the technical solutions in theembodiments with reference to the accompanying drawings in theembodiments. Apparently, the described embodiments are merely some butnot all of the embodiments. All other embodiments obtained by a personof ordinary skill in the art based on the embodiments without creativeefforts shall fall within the protection scope.

It should be understood that the technical solutions in the embodimentsmay be applied to a communications system that uses a carrier sensemultiple access (CSMA for short) technology. The communications systemthat uses the CSMA technology may be a wireless local area network (WLANfor short) that uses the CSMA technology and an unlicensed spectrum, forexample, Wireless Fidelity (WiFi for short), or WorldwideInteroperability for Microwave Access (WiMAX), or may be a mobilecommunications system that uses the CSMA technology and an unlicensedspectrum or a licensed spectrum, for example, a Global System for MobileCommunications (GSM for short), a Code Division Multiple Access (CDMAfor short) system, a Wideband Code Division Multiple Access (WCDMA forshort) system, a general packet radio service (GPRS for short), a LongTerm Evolution (LTE for short) system, an LTE frequency division duplex(FDD for short) system, an LTE time division duplex (TDD for short)system, or a Universal Mobile Telecommunications System (UMTS forshort).

An access point (AP for short) described in the present invention may bea WLAN AP that uses an unlicensed spectrum, or may be a base stationthat uses an unlicensed spectrum or a licensed spectrum. The WLAN may beWireless Fidelity (WiFi for short), or may be Worldwide Interoperabilityfor Microwave Access (WiMAX for short), or the like, which is notlimited in the present invention. The base station that uses anunlicensed spectrum or a licensed spectrum may be a base transceiverstation (BTS for short) in the GSM or the CDMA, may be a NodeB in theWCDMA, or may be an eNB or an e-NodeB in the LTE, which is not limitedin the present invention.

A station (STA for short) may be connected to the Internet by using anAP. The station may be a device with a function such as signalcollection, data processing, or wireless communication. For example, thestation may be a fixed terminal, or may be a mobile terminal (forexample, a mobile phone, or a computer with a mobile terminal).

In the conventional art, a backoff time in a channel selection processis long, and channel utilization is low. Referring to FIG. 1, FIG. 1 isa schematic diagram of an instance of a backoff process involvingmultiple channels and multiple backoff counters. It is assumed that aSTA needs to send data, and a bandwidth requirement is three channels.Four backoff counters are maintained on four channels including achannel 1, a channel 2, a channel 3, and a channel 4, and backoff countvalues of the backoff counters are 3, 3, 2, and 2 respectively. As shownin FIG. 1, in a timeslot 1, all the four channels are idle, and 1 issubtracted from each backoff count value, that is, 4 is subtracted fromthe backoff count values of the four idle channels in total. In atimeslot 2, because the channel 4 is busy in the backoff process,backoff stops, and 1 is separately subtracted from the backoff countvalues of the other three channels, that is, the backoff count value ofthe channel 3 is decreased to 0, and 3 is subtracted from the backoffcount values of the three idle channels in total. In a timeslot 3,because the backoff count value of the channel 3 is already decreased to0, the STA occupies the channel 3, and 1 is separately subtracted fromthe backoff count values of the channel 1 and the channel 2, that is,both the backoff count values of the channel 1 and the channel 2 aredecreased to 0, and 2 is subtracted from the backoff count values of thethree idle channels in total. After the timeslot 3, the backoff countvalues of the channel 1 and the channel 2 are also decreased to 0, andthe bandwidth requirement of the STA is met. From a timeslot 5, the STAstarts to send data on the channel 1, the channel 2, and the channel 3.

As shown in the foregoing instance, in the timeslot 3, because thebackoff count value of the channel 3 is already decreased to 0, the STAoccupies the channel 3, and in the timeslot, only 2 is subtracted fromthe backoff count values of the three backoff counters on the three idlechannels, and a total subtracted value of the backoff count values inthe timeslot<a quantity of idle channels. Therefore, a backoff time inthe channel selection process is long, and channel utilization is low.

Referring to FIG. 2, FIG. 2 is an instance of an application scenarioaccording to an embodiment, involving a data transmit end 210 and a datareceive end 220. Data is carried between the transmit end 210 and thereceive end 220 by using a channel. A channel selection method in thisembodiment may be applied to the transmit end 210, so that when thetransmit end 210 needs to send data to the receive end 220, the transmitend 210 selects a channel for carrying data.

This embodiment may be applied to a system in which a node needs arandom access channel when sending data, for example, the WiFi systemmentioned above or an LTE-U system. When the transmit end 210 sendsuplink data, the transmit end 210 needs to select an uplink channel, orwhen the transmit end 210 sends downlink data, the transmit end 210needs to select a downlink channel. For example, when this embodiment isapplied to the WiFi system, the transmit end 210 may be a station STA,the receive end 220 may be an AP or an access point of a basic serviceset (BSS, Basic Service Set), and the transmit end 210 needs to selectan uplink channel; or the transmit end 210 may be an AP or an accesspoint of a BSS, the receive end 220 may be a STA, and the transmit end210 needs to select a downlink channel.

Referring to FIG. 3, FIG. 3 is a flowchart of an embodiment of a channelselection method according to the disclosure. This embodiment isdescribed from a perspective of a data transmit end.

Step 301: Rank multiple channels, and generate a backoff count value.

When the transmit end sends uplink data, the channel in this embodimentis an uplink channel, or when the transmit end sends downlink data, thechannel in this embodiment is a downlink channel.

Because there is a correspondence between a physical channel and alogical channel, the channel in this embodiment may be a physicalchannel or a logical channel. In a case in which the correspondencebetween a physical channel and a logical channel is fixed, a processingresult in this embodiment is not affected by whether the channel is aphysical channel or a logical channel.

Step 302: Sequentially decrement, from an initial timeslot, the backoffcount value in each timeslot according to a ranking sequence of thechannels and busy/idle states of all the channels until the backoffcount value is 0.

The initial timeslot refers to the first timeslot in which the transmitend performs step 302, that is, a timeslot in which the transmit endstarts to decrement the backoff count value. Determining of the initialtimeslot is related to a time determined by the transmit end forperforming channel selection and channel access, and a specificdetermining method is not described in detail herein.

Step 303: Select, from the multiple channels according to a result ofthe decrement performed on the backoff count value and a busy/idle stateof at least one of the multiple channels, a channel that is used by thetransmit end for sending data.

The method may further include: determining a correspondence between thechannel and an associated channel. In this embodiment, when the channelis a physical channel, the associated channel is a logical channel; orwhen the channel is a logical channel, the associated channel is aphysical channel. A sequence of performing this step, step 301, step302, and step 303 is not limited.

In this embodiment, multiple channels are ranked, and a backoff countvalue is generated; from an initial timeslot, the backoff count value issequentially decremented in each timeslot according to a rankingsequence of the channels and busy/idle states of all the channels untilthe backoff count value is 0; and a channel that is used by a transmitend for sending data is selected from the multiple channels according toa result of the decrement performed on the backoff count value and abusy/idle state of at least one of the multiple channels, so that in achannel selection process, all channels use a same backoff count value,and the backoff count value is decremented according to a busy/idlestate of each channel, which makes a total subtracted value of thebackoff count value in each timeslot greater than or equal to a quantityof idle channels, thereby accelerating a speed of decrementing thebackoff count value to 0, shortening a backoff time in the channelselection process, and improving channel utilization.

Referring to FIG. 4, FIG. 4 is a flowchart of another embodiment of achannel selection method according to the disclosure. The methodincludes the following steps:

Step 401: A transmit end determines a correspondence between a channeland an associated channel.

In step 401, the channel may be a physical channel, the associatedchannel may be a logical channel; or the channel may be a logicalchannel, the associated channel may be a physical channel. Therefore, instep 401, the transmit end actually determines a correspondence betweena physical channel and a logical channel.

The physical channel involved in step 401 may be all or some of physicalchannels that can be sensed by the transmit end, which is not limited inthis embodiment. Similarly, the logical channel involved in step 401 maybe all or some of logical channels between the transmit end and areceive end, which is not limited in this embodiment.

In a first possible implementation manner, step 401 may include:

determining, by the transmit end, a correspondence between a physicalchannel and a logical channel according to frequencies of the physicalchannel and the logical channel, so that when physical channels areranked according to frequencies, logical channels corresponding to thephysical channels are also ranked according to a same frequencysequence.

For example, assuming a quantity of physical channels is 15, and aquantity of logical channels is 15, the 15 physical channels arenumbered as a physical channel 1 to a physical channel 15 respectivelyaccording to frequencies in a descending order, and the logical channelsare numbered as a logical channel 1 to a logical channel 15 respectivelyaccording to the frequencies in the descending order. In this case, thecorrespondence between a physical channel and a logical channel may bedetermined as follows: the physical channel 1 is corresponding to thelogical channel 1, the physical channel 2 is corresponding to thelogical channel 2, and by analogy, until the physical channel 15 iscorresponding to the logical channel 15, as shown in the first columnand the second column in the following Table 1.

If the channel selection method in this embodiment is applied to a WiFisystem, when the correspondence between a physical channel and a logicalchannel is determined in the first possible implementation manner, aprobability that a channel use conflict occurs between neighboring BSSson some channels is relatively high.

For example, assuming a BSS1, a BSS2, and a BSS3 are neighboring BSSs,an access point of the BSS1 is an access point 1, an access point of theBSS2 is an access point 2, and an access point of the BSS3 is an accesspoint 3. In a case of a same decrement step, a same initial timeslot, asame ranking sequence of physical channels, and a same correspondencebetween a physical channel and a logical channel, if the access point 1and the access point 3 are corresponding to a same backoff randomnumber, a reference channel obtained by the access point 1 isnecessarily the same as that obtained by the access point 3. In step405, if the access point 1 and the access point 3 use a sameimplementation method for selecting, according to the reference channel,a channel for sending data, a channel selected by the access point 1 forsending data is also the same as that selected by the access point 3,and consequently the access point 1 and the access point 3 send data onthe same channel, and a channel use conflict occurs between the BSS1 andthe BSS3. For example, as shown in Table 1, assuming the decrement stepis 1, initial timeslots are the same, a backoff random number of theaccess point 1 is 5, a backoff random number of the access point 2 is 4,and a backoff random number of the access point 3 is 5, both a referencechannel obtained by the access point 1 and a reference channel obtainedby the access point 3 are a physical channel 5 (a logical channel 5).Further, if the access point 1 and the access point 3 use a sameimplementation method for selecting, according to the reference channel,a channel for sending data, the access point 1 and the access point 3select a same channel for sending data, and consequently the accesspoint 1 and the access point 3 send data on the same channel, and achannel use conflict occurs between the BSS1 and the BSS3.

TABLE 1 Access Access Access point 1 point 2 point 3 (BSS1) (BSS2)(BSS3) Physical channel 0 Logical channel 0 0 0 0 Physical channel 1Logical channel 1 1 1 1 Physical channel 2 Logical channel 2 2 2 2Physical channel 3 Logical channel 3 3 3 3 Physical channel 4 Logicalchannel 4 4 4 4 Physical channel 5 Logical channel 5 5 5 5 Physicalchannel 6 Logical channel 6 6 6 6 Physical channel 7 Logical channel 7 77 7 Physical channel 8 Logical channel 8 8 8 8 Physical channel 9Logical channel 9 9 9 9 Physical channel 10 Logical channel 10 10 10 10Physical channel 11 Logical channel 11 11 11 11 Physical channel 12Logical channel 12 12 12 12 Physical channel 13 Logical channel 13 13 1313 Physical channel 14 Logical channel 14 14 14 14 Physical channel 15Logical channel 15 15 15 15

Therefore, this embodiment further provides the following second andthird possible implementation manners, so as to reduce the probabilityof a channel use conflict between BSSs. It should be noted that, thesecond and the third possible implementation manners can reduce theprobability of a channel use conflict between BSSs only in a case inwhich the channel is a logical channel, that is, the transmit enddirectly selects a logical channel for sending data. However, the secondand the third possible implementation manners may also be applicable toa case in which the channel is a physical channel, that is, the transmitend directly selects a physical channel for sending data.

In the second possible implementation manner, step 401 may include:

randomly determining, by the transmit end, a correspondence between aphysical channel and a logical channel.

In the third possible implementation manner, step 401 may include:

numbering, by the transmit end, a physical channel and a logical channelaccording to a same frequency sequence, and determining a correspondencebetween a physical channel and a logical channel according to thefollowing number relationship: logical channel number=(physical channelnumber+offset random number) mod total quantity of physical channels.

In the third possible implementation manner, when this embodiment isapplied to the WiFi system, nodes of a same BSS such as STAs, APs, oraccess points may use a same offset random number, and nodes ofdifferent BSSs may use different offset random numbers, that is, anoffset random number is associated with a BSS, and different BSSs arecorresponding to different offset random numbers. In this way, theprobability of a channel use conflict between neighboring BSSs can bereduced.

For example:

The foregoing BSS1, BSS2, and BSS3 are still used as an example.Assuming an offset random number of the BSS1 is 11, an offset randomnumber of the BSS2 is 8, and an offset random number of the BSS3 is 4,logical channel number in the BSS1=(physical channel number+11) mod 16,logical channel number in the BSS2=(physical channel number+8) mod 16,and logical channel number in the BSS3=(physical channel number+4) mod16. In this case, a correspondence between logical channel numbers inthe BSS1, the BSS2, and the BSS3 and physical channel numbers are shownin Table 2.

TABLE 2 BSS1 BSS2 BSS3 Physical channel 0 Logical channel 11 Logicalchannel 8 Logical channel 4 Physical channel 1 Logical channel 12Logical channel 9 Logical channel 5 Physical channel 2 Logical channel13 Logical channel 10 Logical channel 6 Physical channel 3 Logicalchannel 14 Logical channel 11 Logical channel 7 Physical channel 4Logical channel 15 Logical channel 12 Logical channel 8 Physical channel5 Logical channel 0 Logical channel 13 Logical channel 9 Physicalchannel 6 Logical channel 1 Logical channel 14 Logical channel 10Physical channel 7 Logical channel 2 Logical channel 15 Logical channel11 Physical channel 8 Logical channel 3 Logical channel 0 Logicalchannel 12 Physical channel 9 Logical channel 4 Logical channel 1Logical channel 13 Physical channel 10 Logical channel 5 Logical channel2 Logical channel 14 Physical channel 11 Logical channel 6 Logicalchannel 3 Logical channel 15 Physical channel 12 Logical channel 7Logical channel 4 Logical channel 0 Physical channel 13 Logical channel8 Logical channel 5 Logical channel 1 Physical channel 14 Logicalchannel 9 Logical channel 6 Logical channel 2 Physical channel 15Logical channel 10 Logical channel 8 Logical channel 3

In this case, still according to the foregoing instance, assuming thedecrement step is 1, initial timeslots are the same, a backoff randomnumber of the access point 1 is 5, a backoff random number of the accesspoint 2 is 4, and a backoff random number of the access point 3 is 5. Iflogical channels are traversed in each timeslot according to a sequenceof logical channels 0 to 15 to decrement a backoff random number, both areference channel obtained by the access point 1 and a reference channelobtained by the access point 3 are a logical channel 5, and a referencechannel obtained by the access point 2 is a logical channel 4. However,it may be learned from a correspondence in Table 2 that the logicalchannel 5 in the access point 1 is corresponding to a physical channel10, the logical channel 4 in the access point 2 is corresponding to aphysical channel 12, and the logical channel 5 in the access point 3 iscorresponding to a physical channel 1. The physical channels used by thethree access points are different, thereby reducing the probability of achannel use conflict between neighboring BSSs.

Step 402: The transmit end ranks channels.

The transmit end may rank the channels according to a channel frequencysequence, or may randomly rank the channels, which is not limited inthis embodiment.

Step 403: The transmit end generates a backoff count value.

In a first possible implementation manner, the transmit end may randomlygenerate the backoff random number.

In a second possible implementation manner, the transmit end maydetermine a value of a contention window according to system load and aquantity of channels required by the transmit end, and randomly generatethe backoff count value within a value range of the contention window.

Specifically, the transmit end may determine a standard value A of acontention window according to the system load, and then use a productof the standard value and the quantity of channels required by thetransmit end as a value of the contention window. For example, assumingthe standard value A=32, if the quantity of channels required by thetransmit end is 1, the determined value of the contention window is 32,and if the quantity of channels required by the transmit end is 2, thedetermined value of the contention window is 64.

In this implementation manner, higher system load may lead to a smallerstandard value A, and lower system load may lead to a larger standardvalue A. Therefore, higher system load leads to a smaller quantity oflogical channels that can be selected by the transmit end, and lowersystem load leads to a larger quantity of logical channels that can beselected by the transmit end. In addition, in a case of a same standardvalue A, for two transmit ends that need channels of differentquantities, a transmit end that needs channels of a smaller quantity iscorresponding to a smaller value of a contention window, and a transmitend that needs channels of a larger quantity is corresponding to alarger value of a contention window. Therefore, when the backoff countvalue is randomly generated within the value range of the contentionwindow, a probability that a backoff count value generated by thetransmit end that needs channels of a smaller quantity is smaller than abackoff count value generated by the transmit end that needs channels ofa larger quantity is higher, and accordingly a probability that thetransmit end that needs channels of a smaller quantity preferentiallyaccesses a channel is higher.

A sequence of performing the three steps including step 401 to step 403is not limited.

Step 404: The transmit end sequentially decrements, from an initialtimeslot, the backoff count value in each timeslot according to aranking sequence of the channels and busy/idle states of all thechannels until the backoff count value is 0.

In this embodiment, a next idle channel of a channel whose backoff countvalue is 0 is referred to as a reference channel.

The decrementing the backoff count value may include:

for each channel, subtracting a decrement step from a result ofdecrement performed according to a busy/idle state of a previous channelof the channel, and using an obtained value as the updated backoff countvalue; or when the channel is busy, using a result of decrementperformed according to a busy/idle state of a previous channel of thechannel as the updated backoff count value, where the decrement step isgreater than or equal to 1.

The decrement step may be any natural number, and a specific value ofthe decrement step is not limited in the present invention. The specificvalue of the decrement step may be preset in the transmit end.

Alternatively, the decrementing the backoff count value may include:

determining, in each timeslot, a decrement step in a current timeslot;and

for each channel, when the channel is idle, subtracting a decrement stepfrom a result of decrement performed according to a busy/idle state of aprevious channel of the channel, and using an obtained value as theupdated backoff count value; or when the channel is busy, using a resultof decrement performed according to a busy/idle state of a previouschannel of the channel as the updated backoff count value, where thedecrement step is greater than or equal to 1.

The determining a decrement step in a current timeslot may include:

determining that the decrement step is 1; or

determining the decrement step according to the following formula:decrement step=quantity of idle channels in the current timeslot divquantity of channels required by the transmit end.

For example, assuming the quantity of idle channels in the currenttimeslot is 9, and the quantity of channels required by the transmit endis 2, the decrement step in the current timeslot=9 div 2=4.

The busy/idle states of all the channels may be implemented byperforming continuous sensing by the transmit end on the channels, and aspecific sensing method is not described in detail in the presentinvention.

In a possible implementation manner, specific implementation of step 404may be implemented by using a method shown in FIG. 5A.

Step 511: In a current timeslot, the transmit end determines whether acurrent channel is idle, and if the current channel is idle, 1 issubtracted from the backoff count value; or if the current channel isnot idle (busy), the backoff count value keeps unchanged.

An initial value of the current timeslot is the initial timeslot, and aninitial value of the current channel is a channel whose ranking sequenceis 1 in the ranking sequence of the channels.

Step 512: The transmit end determines whether the backoff count value is0, and if the backoff count value is 0, the transmit end determines anext channel of the current channel as a reference channel, and ends theprocedure; or if the backoff count value is not 0, performs step 513.

Step 513: The transmit end determines, according to the ranking sequenceof the channels, whether the current channel is the last channel, and ifthe current channel is the last channel, uses a next timeslot of thecurrent timeslot as a current timeslot, uses the first channel as acurrent channel according to the ranking sequence of the channels, andgoes to step 511; or if the current channel is not the last channel,uses a next channel of the current channel as a current channelaccording to the ranking sequence of the channels, and goes to step 511.

According to the foregoing method shown in FIG. 5A, the channels arefirst traversed in the initial timeslot according to the rankingsequence of the channels. If the backoff count value is not decreased to0 after the channels are traversed, the channels are still traversedaccording to the ranking sequence of the channels in a next timeslot ofthe initial timeslot; and by analogy, until when an idle channel istraversed in a timeslot, a value obtained after 1 is subtracted from thebackoff count value is 0, and a reference channel is obtained. Inaddition, in each timeslot, if a traversed channel is busy, the backoffcount value keeps unchanged, and if a traversed channel is idle, 1 issubtracted from the backoff count value. In a decrement process, when anidle channel is traversed in a timeslot, a value obtained after 1 issubtracted from the backoff count value is 0, and a next idle channel ofthe idle channel is a reference channel.

For example:

Assuming a quantity of physical channels is 16, the 16 physical channelsare numbered as a physical channel 0 to a physical channel 15 accordingto frequencies in an ascending order. An initial timeslot is a timeslot0, timeslots following the timeslot 0 are sequentially a timeslot 1, atimeslot 2, and a timeslot 3 . . . , a backoff random number is 48, anda busy/idle state of each physical channel in each timeslot is shown inTable 1. To facilitate description of a decrement process of a backoffcounter, if a physical channel is busy in a corresponding timeslot,“Busy” is used in the table for indication, and if a physical channel isidle in a corresponding timeslot, serial numbers starting from 0 areused for indication.

Referring to the following Table 3, first, in the timeslot 0, thephysical channel 0 to the physical channel 15 are traversed according toa sequence from the physical channel 0 to the physical channel 15, andbecause the physical channel 0 to the physical channel 15 all are in anidle state in the timeslot 0, the backoff count value is decreased to32. Then, in the timeslot 1, the physical channel 0 to the physicalchannel 15 are traversed according to the sequence from the physicalchannel 0 to the physical channel 15, and because the physical channel 0to the physical channel 15 all are in an idle state in the timeslot 1,the backoff count value is decreased to 16. Then, in the timeslot 2, thephysical channel 0 to the physical channel 15 are traversed according tothe sequence from the physical channel 0 to the physical channel 15, andbecause the physical channel 4 and the physical channel 5 are in a busystate in the timeslot 2, and the other physical channels are in an idlestate in the timeslot 2, the backoff count value is decreased to 2.Then, in the timeslot 3, the physical channel 0 to the physical channel15 are traversed according to the sequence from the physical channel 0to the physical channel 15, and when traversal of the physical channelsis performed on the physical channel 1, the backoff count value isdecreased to 0, and a next idle physical channel of the physical channel1, that is, the physical channel 2, is used as a reference channel.

TABLE 3 Timeslot Timeslot Timeslot Timeslot Timeslot 0 1 2 3 4 . . .Physical channel 0 0 16 32 46 59 . . . Physical channel 1 1 17 33 47 60. . . Physical channel 2 2 18 34 48 61 . . . Physical channel 3 3 19 3549 62 . . . Physical channel 4 4 20 Busy Busy Busy . . . Physicalchannel 5 5 21 Busy Busy Busy . . . Physical channel 6 6 22 36 50 63 . .. Physical channel 7 7 23 37 51 64 . . . Physical channel 8 8 24 38 BusyBusy . . . Physical channel 9 9 25 39 52 65 . . . Physical channel 10 1026 40 53 66 . . . Physical channel 11 11 27 41 54 67 . . . Physicalchannel 12 12 28 42 55 68 . . . Physical channel 13 13 29 43 56 69 . . .Physical channel 14 14 30 44 57 70 . . . Physical channel 15 15 31 45 5871 . . .

In another possible implementation manner, specific implementation ofstep 404 may be implemented by using a method shown in FIG. 5B.

Step 521: The transmit end determines a decrement step in a currenttimeslot according to a formula: decrement step=quantity of idlechannels in the current timeslot div quantity of channels required bythe transmit end.

Step 522: In the current timeslot, the transmit end determines whether acurrent channel is idle, and if the current channel is idle, the backoffcount value is updated by using a value obtained by subtracting thedecrement step in the current timeslot from the backoff count value; orif the current channel is not idle (busy), the backoff count value keepsunchanged.

An initial value of the current timeslot is the initial timeslot, and aninitial value of the current channel is a channel whose ranking sequenceis 1 in the ranking sequence of the channels.

Step 523: The transmit end determines whether the backoff count value is0, and if the backoff count value is 0, determines a next channel of thecurrent channel as a reference channel, and ends the procedure; or ifthe backoff count value is not 0, performs step 524.

Step 524: The transmit end determines, according to the ranking sequenceof the channels, whether the current channel is the last channel, and ifthe current channel is the last channel, uses a next timeslot of thecurrent timeslot as a current timeslot, uses the first channel as acurrent channel according to the ranking sequence of the channels, andgoes to step 521; or if the current channel is not the last channel,uses a next channel of the current channel as a current channelaccording to the ranking sequence of the channels, and goes to step 522.

A difference between FIG. 5B and FIG. 5A lies only in that: a decrementstep in each timeslot in the method shown in FIG. 5A is 1, while in themethod shown in FIG. 5B, a decrement step in each timeslot is determinedaccording to a quantity of idle channels in the timeslot and thequantity of channels required by the transmit end. In comparison to themethod shown in FIG. 5A, the decrement step in each timeslot in themethod shown in FIG. 5B may be 1 or a value greater than 1. Therefore,when a backoff count value is decremented by using the method shown inFIG. 5B, a speed of decrementing the backoff count value to 0 is higher,a backoff time in a channel selection process is shorter, and furtherchannel utilization is improved.

For example:

Assuming a quantity of physical channels is 16, the 16 physical channelsare numbered as a physical channel 0 to a physical channel 15 accordingto frequencies in an ascending order. A quantity of channels required bythe transmit end is 4. An initial timeslot is a timeslot 0, timeslotsfollowing the timeslot 0 are sequentially a timeslot 1, a timeslot 2,and a timeslot 3 . . . , a backoff random number is 48, and a busy/idlestate of each physical channel in each timeslot is shown in Table 2. Ifa physical channel is busy in a corresponding timeslot, “Busy” is usedin the table for indication, and if a physical channel is idle in acorresponding timeslot, “Idle” is used in the table for indication.

Referring to the following Table 4, because there are eight idlephysical channels in the timeslot 0, a decrement step in the timeslot 0is: 8 div 4=2. In the timeslot 0, the physical channel 0 to the physicalchannel 15 are traversed according to a sequence from the physicalchannel 0 to the physical channel 15, and because the eight physicalchannels are in an idle state in the timeslot 0, the backoff count valueis decreased to 32. Then, because there are eight idle physical channelsin the timeslot 1, a decrement step in the timeslot 0 is also 2. In thetimeslot 1, the physical channel 0 to the physical channel 15 aretraversed according to the sequence from the physical channel 0 to thephysical channel 15, and because the eight physical channels are in anidle state in the timeslot 1, the backoff count value is decreased to16. Then, because there are 14 idle physical channels in the timeslot 2,a decrement step in the timeslot 2 is: 14 div 4=3. In the timeslot 2,the physical channel 0 to the physical channel 15 are traversedaccording to the sequence from the physical channel 0 to the physicalchannel 15, and when traversal of the physical channels is performed onthe physical channel 7, the backoff count value is decreased to 0, and anext idle physical channel of the physical channel 7, that is, thephysical channel 8, is used as a reference channel.

TABLE 4 Timeslot 0 Timeslot 1 Timeslot 2 . . . Physical channel 0 IdleBusy Busy . . . Physical channel 1 Idle Idle Busy . . . Physical channel2 Idle Idle Idle . . . Physical channel 3 Idle Idle Idle . . . Physicalchannel 4 Busy Idle Idle . . . Physical channel 5 Busy Busy Idle . . .Physical channel 6 Busy Busy Idle . . . Physical channel 7 Busy BusyIdle . . . Physical channel 8 Idle Busy Idle . . . Physical channel 9Idle Idle Idle . . . Physical channel 10 Idle Idle Idle . . . Physicalchannel 11 Idle Busy Idle . . . Physical channel 12 Busy Busy Idle . . .Physical channel 13 Busy Idle Idle . . . Physical channel 14 Busy BusyIdle . . . Physical channel 15 Busy Idle Idle . . .

Step 405: The transmit end selects, from the multiple channels accordingto a result of the decrement performed on the backoff count value and abusy/idle state of at least one of the multiple channels, a channel thatis used by the transmit end for sending data.

Step 405 may include:

using a next idle channel of a channel whose backoff count value is 0 asa reference channel, determining m1 idle channels preceding thereference channel, the reference channel, and n1 idle channels followingthe reference channel as a channel candidate set according to theranking sequence of the channels, and selecting, from the channelcandidate set, p channels as channels that are used by the transmit endfor sending data, where m1>=0, n1>=0, both m1 and n1 are integers,m1+n1>=p−1, and p is the quantity of channels required by the transmitend.

The p channels may be randomly selected from the channel candidate setor a channel with optimal channel quality may be preferentially selectedfrom the channel candidate set, which is not limited in this embodiment.

For example, assuming m1=3, n1=3, and p=1, logical channels are rankedaccording to a sequence of logical channels 0 to 15, and the referencechannel eventually obtained in step 404 is the logical channel 8. Inthis case, assuming logical channels 5 to 7 and logical channels 9 to 11all are in an idle state in a current timeslot, a logical channel may berandomly selected from logical channels 5 to 11 as the channel that isused by the transmit end for sending data, or a logical channel withbest channel quality may be selected from logical channels 5 to 11 asthe channel that is used by the transmit end for sending data.

Alternatively, step 405 may include:

using a next idle channel of a channel whose backoff count value is 0 asa reference channel, and determining, according to the ranking sequenceof the channels, m2 idle channels preceding the reference channel, thereference channel, and n2 idle channels following the reference channelas channels that are used by the transmit end for sending data, wherem2>=0, n2>=0, both m2 and n2 are integers, and m2+n2=p−1.

For example, assuming m2=1, n1=1, and p=3, logical channels are rankedaccording to a sequence of logical channels 0 to 15, and the referencechannel eventually obtained in step 404 is the logical channel 8. Inthis case, assuming both the logical channel 7 and the logical channel 9are in an idle state in a current timeslot, logical channels 7 to 9 maybe selected as channels that are used by the transmit end for sendingdata.

In this embodiment, in a channel selection process, all channels use asame backoff count value, and the backoff count value is decrementedaccording to a busy/idle state of each channel, which makes a totalsubtracted value of the backoff count value in each timeslot greaterthan or equal to a quantity of idle channels, thereby accelerating aspeed of decrementing the backoff count value to 0, shortening a backofftime in the channel selection process, and improving channelutilization.

Corresponding to an embodiment of a channel selection method in thepresent invention, the present invention further provides an embodimentof a transmit end.

Referring to FIG. 6, FIG. 6 is a block diagram of an embodiment of atransmit end according to the disclosure. The transmit end 600 includes:a ranking unit 610, a generation unit 620, a decrement unit 630, and aselection unit 640.

The ranking unit 610 is configured to rank multiple channels.

The generation unit 620 is configured to generate a backoff count value.

The decrement unit 630 is configured to sequentially decrement, from aninitial timeslot, the backoff count value in each timeslot according toa sequence of ranking the channels by the ranking unit and busy/idlestates of all the channels until the backoff count value is 0.

The selection unit 640 is configured to select, from the multiplechannels according to a result of the decrement performed by thedecrement unit 630 on the backoff count value and a busy/idle state ofat least one of the multiple channels, a channel that is used by thetransmit end for sending data.

Optionally, the decrement unit 630 may be specifically configured to:

for each channel, when the channel is idle, subtract a decrement stepfrom a result of decrement performed according to a busy/idle state of aprevious channel of the channel, and use an obtained value as theupdated backoff count value; or when the channel is busy, use a resultof decrement performed according to a busy/idle state of a previouschannel of the channel as the updated backoff count value, where thedecrement step is greater than or equal to 1.

Optionally, the decrement unit 630 may be further configured todetermine, in each timeslot, a decrement step in a current timeslot.

Optionally, the decrement unit 630 may be specifically configured to:

determine the decrement step according to the following formula:decrement step=quantity of idle channels in the current timeslot divquantity of channels required by the transmit end.

Optionally, the selection unit 640 may be specifically configured to:

use a next idle channel of a channel whose backoff count value is 0 as areference channel, determine m1 idle channels preceding the referencechannel, the reference channel, and n1 idle channels following thereference channel as a channel candidate set according to the rankingsequence of the channels, and select, from the channel candidate set, pchannels as channels that are used by the transmit end for sending data,where m1>=0, n1>=0, both m1 and n1 are integers, m1+n1>=p−1, and p isthe quantity of channels required by the transmit end.

Optionally, the generation unit 620 may be specifically configured to:

randomly generate the backoff count value; or

determine a value of a contention window according to system load andthe quantity of channels required by the transmit end, and randomlygenerate the backoff count value within a value range of the contentionwindow.

Optionally, the transmit end may further include: a determining unit,configured to determine a correspondence between the channel and anassociated channel, where when the channel is a physical channel, theassociated channel is a logical channel; or when the channel is alogical channel, the associated channel is a physical channel.

Optionally, the determining unit may be specifically configured to:

randomly determine a correspondence between a physical channel and alogical channel; or

determine a correspondence between a physical channel and a logicalchannel according to frequencies of the physical channel and the logicalchannel, so that when physical channels are ranked according tofrequencies, logical channels corresponding to the physical channels arealso ranked according to a same frequency sequence; or

number a physical channel and a logical channel according to a samefrequency sequence, and determine a correspondence between a physicalchannel and a logical channel according to the following numberrelationship: logical channel number=(physical channel number+offsetrandom number) mod total quantity of physical channels.

In this embodiment, in a channel selection process, all channels use asame backoff count value, and the backoff count value is decrementedaccording to a busy/idle state of each channel, which makes a totalsubtracted value of the backoff count value in each timeslot greaterthan or equal to a quantity of idle channels, thereby accelerating aspeed of decrementing the backoff count value to 0, shortening a backofftime in the channel selection process, and improving channelutilization.

Referring to FIG. 7, FIG. 7 is a schematic structural diagram of atransmit end according to an embodiment. The transmit end may be a STA,an AP, an access point, or the like in a WiFi system. The transmit end700 includes: a processor 710, a memory 720, a transceiver 730, and abus 740.

The processor 710, the memory 720, and the transceiver 730 are connectedto each other by using the bus 740, and the bus 740 may be an ISA bus, aPCI bus, an EISA bus, or the like. The bus may be classified into anaddress bus, a data bus, a control bus, and the like. For ease ofdenotation, the bus is indicated by using only one thick line in FIG. 7;however, it does not indicate that there is only one bus or only onetype of bus.

The memory 720 is configured to store a program. Specifically, theprogram may include program code, and the program code includes acomputer operation instruction. The memory 720 may include a high-speedRAM memory, and may further include a non-volatile memory (non-volatilememory), for example, at least one magnetic disk memory.

The transceiver 730 is configured to connect to another device andcommunicate with the another device.

The processor 710 executes the program code, so as to: rank multiplechannels, and generate a backoff count value; sequentially decrement,from an initial timeslot, the backoff count value according to a rankingsequence of the channels and busy/idle states of all the channels untilthe backoff count value is 0; and select, from the multiple channelsaccording to a result of the decrement performed on the backoff countvalue and a busy/idle state of at least one of the multiple channels, achannel that is used by the transmit end for sending data.

Optionally, the processor 710 may be specifically configured to:

for each channel, when the channel is idle, subtract a decrement stepfrom a result of decrement performed according to a busy/idle state of aprevious channel of the channel, and use an obtained value as theupdated backoff count value; or when the channel is busy, use a resultof decrement performed according to a busy/idle state of a previouschannel of the channel as the updated backoff count value, where thedecrement step is greater than or equal to 1.

Optionally, the processor 710 may be further configured to determine, ineach timeslot, a decrement step in a current timeslot.

Optionally, the processor 710 may be specifically configured todetermine the decrement step according to the following formula:decrement step=quantity of idle channels in the current timeslot divquantity of channels required by the transmit end.

Optionally, the processor 710 may be specifically configured to:

use a next idle channel of a channel whose backoff count value is 0 as areference channel, determine m1 idle channels preceding the referencechannel, the reference channel, and n1 idle channels following thereference channel as a channel candidate set according to the rankingsequence of the channels, and select, from the channel candidate set, pchannels as channels that are used by the transmit end for sending data,where m1>=0, n1>=0, both m1 and n1 are integers, m1+n1>=p−1, and p isthe quantity of channels required by the transmit end.

Optionally, the processor 710 may be specifically configured to:

randomly generate the backoff count value; or

determine a value of a contention window according to system load andthe quantity of channels required by the transmit end, and randomlygenerate the backoff count value within a value range of the contentionwindow.

Optionally, the processor 710 may be further configured to:

determine a correspondence between the channel and an associatedchannel, where

when the channel is a physical channel, the associated channel is alogical channel; or when the channel is a logical channel, theassociated channel is a physical channel.

Optionally, the processor 710 may be specifically configured to:

randomly determine a correspondence between a physical channel and alogical channel; or

determine a correspondence between a physical channel and a logicalchannel according to frequencies of the physical channel and the logicalchannel, so that when physical channels are ranked according tofrequencies, logical channels corresponding to the physical channels arealso ranked according to a same frequency sequence; or

number a physical channel and a logical channel according to a samefrequency sequence, and determine a correspondence between a physicalchannel and a logical channel according to the following numberrelationship: logical channel number=(physical channel number+offsetrandom number) mod total quantity of physical channels.

In this embodiment, in a channel selection process, all channels use asame backoff count value, and the backoff count value is decrementedaccording to a busy/idle state of each channel, which makes a totalsubtracted value of the backoff count value in each timeslot greaterthan or equal to a quantity of idle channels, thereby accelerating aspeed of decrementing the backoff count value to 0, shortening a backofftime in the channel selection process, and improving channelutilization.

The embodiments in this specification are all described in a progressivemanner, for same or similar parts in the embodiments, reference may bemade to these embodiments, and each embodiment focuses on a differencefrom other embodiments. The apparatus provided in the embodiments isdescribed relatively simply because it corresponds to the methodprovided in the embodiments, and for portions related to those of themethod, reference may be made to the description of the method.

It should be noted that in this specification, relational terms such asfirst and second are only used to distinguish one entity or operationfrom another, and do not necessarily require or imply that any actualrelationship or sequence exists between these entities or operations.Moreover, the terms “include”, “comprise”, or their any other variant isintended to cover a non-exclusive inclusion, so that a process, amethod, an article, or an apparatus that includes a list of elements notonly includes those elements but also includes other elements which arenot expressly listed, or further includes elements inherent to suchprocess, method, article, or apparatus. An element preceded by “includesa . . . ” does not, without more constraints, preclude the existence ofadditional identical elements in the process, method, article, orapparatus that includes the element.

Through the foregoing description of the implementation manners, it maybe clearly understood by a person skilled in the art that theimplementation manners in the present invention may be implemented bysoftware in addition to necessary universal hardware, where theuniversal hardware includes a universal integrated circuit, a universalCPU, a universal memory, a universal device, and the like, anddefinitely may also be implemented by application-specific hardware,including an application-specific integrated circuit, anapplication-specific CPU, an application-specific memory, anapplication-specific device, and the like, but in many cases, the formerone is a preferred implementation manner. Based on such understandings,the essence of the technical solutions in the present invention or thepart that makes contributions to the conventional art can be embodied ina software product. The computer software product may be stored in areadable storage medium including any medium that can store programcode, such as a USB flash disk, a removable storage medium, a read-onlymemory (ROM), a random access memory (RAM), a magnetic disk, or anoptical disc, and includes several instructions for instructing acomputer device (which may be a personal computer, a server, a networkdevice, or the like) to perform the methods in the embodiments.

The embodiments in this specification are all described in a progressivemanner, for same or similar parts in the embodiments, reference may bemade to these embodiments, and each embodiment focuses on a differencefrom other embodiments. Especially, a system embodiment is basicallysimilar to a method embodiment, and therefore is described briefly; forrelated parts, reference may be made to partial descriptions in themethod embodiment.

The foregoing descriptions are implementation manners, but are notintended to limit the protection scope. Any modification, equivalentreplacement, and improvement made without departing from the principleshall fall within the protection scope.

What is claimed is:
 1. A channel selection method comprising: generatinga backoff count value; determining, for a timeslot, a value of adecrement step that equals a quantity of idle channels in the timeslot,wherein a quantity of channels required by a transmit end for sendingdata equals 1; sequentially decrementing the backoff count valueaccording to busy/idle states of multiple channels; and selecting, fromthe multiple channels, a channel that is used by the transmit end forsending the data.
 2. The method according to claim 1, wherein selectingthe channel, from the multiple channels comprises: randomly selectingthe channel, from the multiple channels according to a result of thedecrement performed on the backoff count value and a busy/idle state ofat least one of the multiple channels.
 3. The method according to claim1, wherein selecting the channel, from the multiple channels comprises:randomly ranking the multiple channels; selecting one of the randomlyranking channels as the channel.
 4. The method according to claim 1,further comprising: determining a correspondence between one of themultiple channels and one of multiple associated channels, wherein a)when the multiple channels are physical channels, the multipleassociated channels are logical channels; or b) when the multiplechannel are logical channels, the multiple associated channel arephysical channels.
 5. The method according to claim 4, whereindetermining the correspondence between the physical channel and thelogical channel comprises one of the following: (a) randomly determiningthe correspondence between the physical channel and the logical channel;(b) determining the correspondence between the physical channel and thelogical channel according to frequencies of the physical channel and thelogical channel, so that when physical channels are ranked according tofrequencies, logical channels associated with the physical channels arealso ranked according to a same frequency sequence; and (c) numberingthe physical channel and the logical channel according to a samefrequency sequence, and determining a correspondence between thephysical channel and the logical channel according to the followingnumber relationship: a logical channel number equals a sum value mod atotal quantity of physical channels, wherein the sum value is a sum ofphysical channel number and offset random number.
 6. A transmit endcomprising: a processor and a memory connected to each other by a bus;wherein the memory is configured to store instructions of a program forthe processor to execute; wherein the processor executes theinstructions so as to: generate a backoff count value; determine, for atimeslot, a value of a decrement step that equals a quantity of idlechannels in the timeslot, wherein a quantity of channels required by atransmit end for sending data equals 1; sequentially decrement thebackoff count value according to busy/idle states of multiple channels;and select, from the multiple channels, a channel that is used by thetransmit end for sending the data.
 7. The transmit end according toclaim 6, wherein the processor is further configured to: randomly selectthe channel, from the multiple channels according to a result of thedecrement performed on the backoff count value and a busy/idle state ofat least one of the multiple channels.
 8. The transmit end according toclaim 6, wherein the processor is further configured to: randomly rankthe multiple channels; select one of the randomly ranking channels asthe channel.
 9. The transmit end according to claim 6, wherein theprocessor is further configured to: determine a correspondence betweenone of the multiple channels and one of multiple associated channels,wherein a) when the multiple channels are physical channels, themultiple associated channels are logical channels; or b) when themultiple channel are logical channels, the multiple associated channelare physical channels.
 10. The transmit end according to claim 9,wherein the processor is further configured to implement one of thefollowing: (a) randomly determining the correspondence between thephysical channel and the logical channel; (b) determining thecorrespondence between the physical channel and the logical channelaccording to frequencies of the physical channel and the logicalchannel, so that when physical channels are ranked according tofrequencies, logical channels associated with the physical channels arealso ranked according to a same frequency sequence; and (c) numberingthe physical channel and the logical channel according to a samefrequency sequence, and determining a correspondence between thephysical channel and the logical channel according to the followingnumber relationship: a logical channel number equals a sum value mod atotal quantity of physical channels, wherein the sum value is a sum ofphysical channel number and offset random number.
 11. A non-transitorycomputer-readable medium having processor-executable instructions storedthereon, which when executed by a processor cause a transmit end toimplement a channel selection method comprising: generating a backoffcount value; determining, for a timeslot, a value of a decrement stepthat equals a quantity of idle channels in the timeslot, wherein aquantity of channels required by a transmit end for sending data equals1; sequentially decrementing the backoff count value according tobusy/idle states of multiple channels; and selecting, from the multiplechannels, a channel that is used by the transmit end for sending thedata.
 12. The non-transitory computer-readable medium according to claim11, wherein selecting the channel, from the multiple channels comprises:randomly selecting the channel, from the multiple channels according toa result of the decrement performed on the backoff count value and abusy/idle state of at least one of the multiple channels.
 13. Thenon-transitory computer-readable medium according to claim 11, whereinselecting the channel, from the multiple channels comprises: randomlyranking the multiple channels; selecting one of the randomly rankingchannels as the channel.
 14. The non-transitory computer-readable mediumaccording to claim 11, further comprising: determining a correspondencebetween one of the multiple channels and one of multiple associatedchannels, wherein a) when the multiple channels are physical channels,the multiple associated channels are logical channels; or b) when themultiple channel are logical channels, the multiple associated channelare physical channels.
 15. The me non-transitory computer-readablemedium according to claim 14, wherein determining the correspondencebetween the physical channel and the logical channel comprises one ofthe following: (a) randomly determining the correspondence between thephysical channel and the logical channel; (b) determining thecorrespondence between the physical channel and the logical channelaccording to frequencies of the physical channel and the logicalchannel, so that when physical channels are ranked according tofrequencies, logical channels associated with the physical channels arealso ranked according to a same frequency sequence; and (c) numberingthe physical channel and the logical channel according to a samefrequency sequence, and determining a correspondence between thephysical channel and the logical channel according to the followingnumber relationship: a logical channel number equals a sum value mod atotal quantity of physical channels, wherein the sum value is a sum ofphysical channel number and offset random number.